package com.wenhai.leetcode.queue;

/**
 * https://leetcode-cn.com/problems/implement-stack-using-queues/
 *
 * 用队列实现栈
 *
 * @author wenhai
 * @date   2021/2/18
 */
public class _225用队列实现栈<E> {
    /** Initialize your data structure here. */
    public _225用队列实现栈() {

    }

//    /** Push element x onto stack. */
//    public void push(E e) {
//
//    }
//
//    /** Removes the element on top of the stack and returns that element. */
//    public E pop() {
//
//    }
//
//    /** Get the top element. */
//    public E top() {
//
//    }
//
//    /** Returns whether the stack is empty. */
//    public boolean empty() {
//
//    }
}
